منابع مشابه
Polymorphic Game Semantics for Dynamic Binding
We present a game semantics for an expressive typing system for block-structured programs with late binding of variables and System F style polymorphism. As well as generic programs and abstract datatypes, this combination may be used to represent behaviour such as dynamic dispatch and method overriding. We give a denotational models for a hierarchy of programming languages based on our typing ...
متن کاملGame Semantics
ion is modelled by currying: [[ ` x : A:M : A! B]] = ([[ ; x : A `M : B]]) : [[ ]]! [[A]]) [[B]]: The interpretation of application makes use of the evaluation map ev : (A) B) A ! B obtained by uncurrying the identity on A ) B. If ` M : A ! B and ` N : A then [[ `MN ]] = h[[ `M ]]; [[ ` N ]]i # ev: We shall now show how PCF can be interpreted in any of the cartesian closed categories C, Ci, Cb ...
متن کاملOperational Nominal Game Semantics
We present a formal correspondence between Laird’s trace semantics and the nominal game model of Murawski and Tzevelekos for RefML, a callby-value language with higher-order references. This gives an operational flavor to game semantics, where denotation of terms is generated via an interactive reduction, which allows to reduce terms with free functional variables, and where pointer structure i...
متن کاملGame semantics and subtyping
Game Semantics is a relatively new framework for the description of the semantics of programming languages. By combining the mathematical elegance of Denotational Semantics with explicitly operational concepts, Game Semantics has made possible the direct and intuitive modelling of a large range of programming constructs. In this thesis, we show how Game Semantics is able to model subtyping. We ...
متن کاملAlgorithmic Nominal Game Semantics
We employ automata over infinite alphabets to capture the semantics of a finitary fragment of ML with ground-type references. Our approach is founded on game semantics, which allows us to translate programs into automata in such a way that contextual equivalence is characterized by a finitary notion of bisimilarity. As a corollary, we derive a decidability result for a class of first-order prog...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2020
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129520000250